A Euclidean Ramsey Problem
نویسندگان
چکیده
منابع مشابه
Approximate euclidean ramsey theorems
According to a classical result of Szemerédi, every dense subset of 1, 2, . . . , N contains an arbitrary long arithmetic progression, if N is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1, 2, . . . , N}d contains an arbitrary large grid, if N is large enough. Here we generalize these results for separated point sets on the ...
متن کاملImproved lower bound on an Euclidean Ramsey problem
It was previously shown that any two-colour colouring of K(Cn) must contain a monochromatic planar K4 subgraph for n ≥ N ∗, where 6 ≤ N ∗ ≤ N and N is Graham’s number. The bound was later [2] improved to 11 ≤ N∗ ≤ N . In this article, it is improved to 13 ≤ N∗ ≤ N .
متن کاملEuclidean Ramsey Theorems
Eucl dean Ramsey Theorems . I P . ERDöS Mathemat cs Inst tute, Hungar an Academy of Sc ence, Budapest 9, Hungary R. L. GRAHAM Bell Telephone Laborator es, Murray H ll, New Jersey 07971 P . MONTGOMERY Systems Development Corporat on, Huntsv lle Alabama B. L . ROTHSCHILD' Un vers ty of Cal forn a, Los Angeles, Cal forn a 90024 J. SPENCER' Massachusetts Inst tute of Technology, Cambr dge, Massachu...
متن کاملA Euclidean Ramsey Result in the Plane
An old question in Euclidean Ramsey theory asks, if the points in the plane are red-blue coloured, does there always exist a red pair of points at unit distance or five blue points in line separated by unit distances? An elementary proof answers this question in the affirmative.
متن کاملHypergraph list coloring and Euclidean Ramsey theory
Abstract: It is well known that one can color the plane by 7 colors with no monochromatic configuration consisting of the two endpoints of a unit segment. In sharp contrast we show that for any finite set of points K in the plane, and for any finite integer s, one can assign a list of s distinct colors to each point of the plane, so that any coloring of the plane that colors each point by a col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2003
ISSN: 0179-5376
DOI: 10.1007/s00454-002-0780-5